A fast projected fixed-point algorithm for large graph matching
نویسندگان
چکیده
منابع مشابه
A fast projected fixed-point algorithm for large graph matching
We propose a fast approximate algorithm for large graph matching. A new projected fixed-point method is defined and a new doubly stochastic projection is adopted to derive the algorithm. Previous graph matching algorithms suffer from high computational complexity and therefore do not have good scalability with respect to graph size. For matching two weighted graphs of n nodes, our algorithm has...
متن کاملAn Integer Projected Fixed Point Method for Graph Matching and MAP Inference
Graph matching and MAP inference are essential problems in computer vision and machine learning. We introduce a novel algorithm that can accommodate both problems and solve them efficiently. Recent graph matching algorithms are based on a general quadratic programming formulation, which takes in consideration both unary and second-order terms reflecting the similarities in local appearance as w...
متن کاملFast Point Matching Algorithm for Mapping Applications
This paper presents a method for image positioning, and map creation. The images are captured by a flying modulo equipped by a camera to observe a selected area. In this study we suppose this system is located at a fixed height, and compare its mechanism to a free pendulum moving with the wind force. The camera is always pointing vertically thanks to a motored system. This system isn’t noise fr...
متن کاملA Fast Matching Algorithm for Graph-Based Handwriting Recognition
The recognition of unconstrained handwriting images is usually based on vectorial representation and statistical classification. Despite their high representational power, graphs are rarely used in this field due to a lack of efficient graph-based recognition methods. Recently, graph similarity features have been proposed to bridge the gap between structural representation and statistical class...
متن کاملA Fast Fixed-Point Algorithm for Independent Component Analysis
We introduce a novel fast algorithm for Independent Component Analysis, which can be used for blind source separation and feature extraction. It is shown how a neural network learning rule can be transformed into a xed-point iteration, which provides an algorithm that is very simple, does not depend on any user-deened parameters, and is fast to converge to the most accurate solution allowed by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2016
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2016.07.015